Distance, dissimilarity index, and network community structure
نویسندگان
چکیده
منابع مشابه
Distance, dissimilarity index, and network community structure.
We address the question of finding the community structure of a complex network. In an earlier effort [H. Zhou, Phys. Rev. E 67, 041908 (2003)], the concept of network random walking is introduced and a distance measure defined. Here we calculate, based on this distance measure, the dissimilarity index between nearest-neighboring vertices of a network and design an algorithm to partition these ...
متن کاملMalmquist Productivity Index with Dynamic Network Structure
Data envelopment analysis (DEA) measures the relative efficiency of decision making units (DMUs) with multiple inputs and multiple outputs. DEA-based Malmquist productivity index measures the productivity change over time. We propose a dynamic DEA model involving network structure in each period within the framework a DEA. We have previously published the network DEA (NDEA) and the dynamic DEA ...
متن کاملmalmquist productivity index with dynamic network structure
data envelopment analysis (dea) measures the relative efficiency of decision making units (dmus) with multiple inputs and multiple outputs. dea-based malmquist productivity index measures the productivity change over time. we propose a dynamic dea model involving network structure in each period within the framework a dea. we have previously published the network dea (ndea) and the dynamic dea ...
متن کاملComplex Network Analysis in Cricket: Community Structure, Player's Role and Performance Index
This paper describes the applications of network methods for understanding interaction within members of sport teams.We analyze the interaction of batsmen in International Cricket matches. We generate batting partnership network (BPN) for different teams and determine the exact values of clustering coefficient, average degree, average shortest path length of the networks and compare them with t...
متن کاملExtremal Optimization and Network Community Structure
The network community structure detection problem has been recently approached with several variants of an extremal optimization algorithm. An extremal optimization algorithm is a stochastic local search method that evolves pairs of individuals that can be represented as having several components by randomly replacing components having worst fitnesses. The number of components to be replaced in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2003
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.67.061901